On the fixing group for a totally pre-ordered Boolean function
نویسندگان
چکیده
منابع مشابه
On Marginal Automorphisms of a Group Fixing the Certain Subgroup
Let W be a variety of groups defined by a set W of laws and G be a finite p-group in W. The automorphism α of a group G is said to bea marginal automorphism (with respect to W), if for all x ∈ G, x−1α(x) ∈ W∗(G), where W∗(G) is the marginal subgroup of G. Let M,N be two normalsubgroups of G. By AutM(G), we mean the subgroup of Aut(G) consistingof all automorphisms which centralize G/M. AutN(G) ...
متن کاملMobile agent group communication ensuring reliability and totally-ordered delivery
In this paper, an atomic mobile agent group communication protocol is designed to have the following beneficial features. The protocol enables each agent to adaptively choose a small number of forwarders among its visiting nodes based on its decision. Also, it replicates paths on which messages should be transmitted to their targeting mobile agents in an effective manner. The mobile agent group...
متن کاملComputing the fixing group of a rational function
Let AutKK(x) be the Galois group of the transcendental degree one pure field extension K ⊆ K(x). In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H ⊆ AutKK(x) and for computing the fixing group Gf of a rational function f ∈ K(x).
متن کامل132 Pre - Boolean Algebra , Ordered Dsmt and Dsm Continuous Models
When implementing the DSmT, a difficulty may arise from the possible huge dimension of hyper-power sets, which are indeed free structures. However, it is possible to reduce the dimension of these structures by involving logical constraints. In this chapter, the logical constraints will be related to a predefined order over the logical propositions. The use of such orders and their resulting log...
متن کاملTotally Ordered Commutative Semigroups
Let 5( + , < ) be a system consisting of a set S endowed with an associative binary operation + and a total ( = linear = simple) order relation < . The composition + and the relation < may be connected by either or both of the following conditions. MC (Monotone Condition). If a and b are elements of 5 such that ax+y ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1979
ISSN: 0012-365X
DOI: 10.1016/0012-365x(79)90037-2